Takagi functions and approximate midconvexity
نویسندگان
چکیده
منابع مشابه
Generalized approximate midconvexity
The existing various notions of generalized convexity are very useful, in particular in optimal control theory (Cannarsa and Sinestrari, 2004) and optimization (for more information and references see Rolewicz, 2005). Therefore, convenient conditions which guarantee generalized convexity are very useful. As we know from the classical theory of convex functions, midconvexity and local upper boun...
متن کاملClassiiers That Approximate Functions Classiiers That Approximate Functions
A classiier system, XCSF, is introduced in which the prediction estimation mechanism is used to learn approximations to functions. The addition of weight vectors to the classiiers allows piecewise-linear approximation, where the classiier's prediction is calculated instead of being a xed scalar. The weight vector and the classiier's condition co-adapt. Results on functions of up to six dimensio...
متن کاملEdge-Isoperimetric Problem for Cayley Graphs and Generalized Takagi Functions
Abstract. Let G be a finite abelian group of exponent m ≥ 2. For subsets A,S ⊆ G, denote by ∂S(A) the number of edges from A to its complement G \ A in the directed Cayley graph, induced by S on G. We show that if S generates G, and A is non-empty, then ∂S(A) ≥ e m |A| ln |G| |A| . Here the coefficient e = 2.718 . . . is best possible and cannot be replaced with a number larger than e. For homo...
متن کاملSensitive Functions and Approximate Problems
We investigate properties offunctions that are good measures of the CRCW PRAM complexity of computing them. While the block sensitivity is known to be a good measure of the CREW PRAM complexity, no such measure is known for CRCW PRAMs. We show that the complexity of computing a function is related to its everywhere ·sepsitivity, introduced by 'Vishkin and Wigderson. Specijically we show thatthe...
متن کاملDistribution of the Maxima of Random Takagi Functions
This paper concerns the maximum value and the set of maximum points of a random version of Takagi's continuous, nowhere di erentiable function. Let F (x) := ∑∞ n=1 ( 1 2 )n−1 εnφ(2 n−1x), x ∈ R, where ε1, ε2, . . . are independent, identically distributed random variables taking values in {−1, 1}, and φ is the tent map de ned by φ(x) = 2dist (x,Z). Let p := P (ε1 = 1), M := max { F (x) : x ∈ R}...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2009
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2009.03.053